Constructions of optimal orthogonal arrays with repeated rows
نویسندگان
چکیده
منابع مشابه
Geometric constructions of optimal optical orthogonal codes
We provide a variety of constructions of (n,w, λ)-optical orthogonal codes using special sets of points and Singer groups in finite projective spaces. In several of the constructions, we are able to prove that the resulting codes are optimal with respect to the Johnson bound. The optimal codes exhibited have λ = 1, 2 and w − 1 (where w is the weight of each codeword in the code). The remaining ...
متن کاملConstructions for optimal optical orthogonal codes
In this paper two recursive constructions for optimal optical orthogonal codes are presented by means of incomplete di/erence matrices and perfect cyclic di/erence packings. These improve the known existence results concerning optimal (v; 4; 1)-OOCs. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملCombinatorial constructions of optimal optical orthogonal codes with weight 4
A (v, k, λ) optical orthogonal code C is a family of (0, 1) sequences of length v and weight k satisfying the following two correlation properties: (1) ∑ 0≤t≤v−1xtxt+i ≤ λ for any x = (x0, x1, . . . , xv−1) ∈ C and any integer i 6≡ 0 (mod v); (2) ∑ 0≤t≤v−1xtyt+i ≤ λ for any x = (x0, x1, . . . , xv−1) ∈ C, y = (y0,y1, . . ., yv−1) ∈ C with x 6= y, and any integer i, where the subscripts are take...
متن کاملUnified combinatorial constructions of optimal optical orthogonal codes
We present unified constructions of optical orthogonal codes (OOCs) using other combinatorial objects such as cyclic linear codes and frequency hopping sequences. Some of obtained OOCs are optimal or asymptotically optimal with respect to the Johnson bound. Also, we are able to show the existence of new optimal frequency hopping sequences (FHSs) with respect to the Singleton bound from our obse...
متن کاملOptical orthogonal codes: Their bounds and new optimal constructions
A (v, k, λa, λc) optical orthogonal code C is a family of (0, 1)-sequences of length v and weight k satisfying the following two correlation properties: (1) ∑ 0≤t≤v−1xtxt+i ≤ λa for any x = (x0, x1, . . . , xv−1) and any integer i 6≡ 0 mod v; and (2) ∑ 0≤t≤v−1xtyt+i ≤ λb for any x = (x0, x1, . . . , xv−1), y = (y0, y1, . . . , yv−1) with x 6= y, and any integer i, where subscripts are taken mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.05.021